An Eeciency Limit of Cellular Mobile Systems
نویسنده
چکیده
In order to limit hando blocking probability, in cellular systems admission control can be applied to new call requests and resources reserved for future hando attempts. Such resource reservation strategies have been widely studied in the literature. The denial of new call attempts, however, impacts system throughput creating a trade-o with hando performance. The contribution of this paper is an analytical investigation of this trade-o . In particular, we study the impact of hando on a cellular system's e ciency which we de ne as the system's throughput normalized by the theoretically optimal throughput at zero user mobility. As a reference case, we rst determine the e ciency of a hypothetical system with deterministic advance reservation. Next, we consider systems with statistical reservation and calculate the maximum achievable e ciency, under the set of possible local admission control strategies subject to a hard constraint on the probability of call failure due to hando blocking. Local admission control strategies are investigated because they represent e cient, yet simple strategies that lend themselves to easy implementation. We note that trunk reservation is a special case of local policies. We relate the calculated e ciency bound to call and mobility characteristics and show that the achievable e ciency decreases with decreasing cell size and with the increasing proportion of multimedia calls, both of which are recognized trends today.
منابع مشابه
Area Spectral E ciency of Cellular Mobile Radio Systems
A general analytical framework quantifying the spectral eeciency of cellular systems with variable-rate transmission is introduced. This eeciency, the area spectral eeciency, deenes the sum of the maximum average data rates per unit bandwidth per unit area supported by a cell's base station. Expressions for this eeciency as a function of the reuse distance for the worst-case and best-case inter...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملAlgorithms for Dynamic Channel Assignment
The eeciency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are veriied by extensive simulations.
متن کاملUnderstanding Temporal Human Mobility Patterns in a City by Mobile Cellular Data Mining, Case Study: Tehran City
Recent studies have shown that urban complex behaviors like human mobility should be examined by newer and smarter methods. The ubiquitous use of mobile phones and other smart communication devices helps us use a bigger amount of data that can be browsed by the hours of the day, the days of the week, geographic area, meteorological conditions, and so on. In this article, mobile cellular data mi...
متن کاملAn Impartial Eeciency Comparison of Fd Constraint Systems
1 A one page summary will be published in the proceedings of the 1998 Conference on Constraint programming (CP'98) Abstract. This paper compares the eeciency of a number of Constraint Logic Programming (CLP) systems in the setting of nite domains. One of the main reasons for adopting CLP technology for solving a problem is the provision of an eecient implementation for the computationally expen...
متن کامل